Method and system for incrementally selecting and providing relevant search engines in response to a user query

ABSTRACT

Methods and systems for incrementally selecting and providing relevant search engines in response to a user query. A method of incrementally selecting and providing relevant search engines is based in part on identifying a set of search engines associated with corresponding metadata, receiving a partial search query entered by the user of a device, inferring after each user keypress a set of potential full queries intended by the user, using the potential full queries and the search engine metadata to identify a set of relevant search engines, and for each of these search engines, providing a direct link to launch a relevant query in the search engine. The user input may be either ambiguous, or erroneous, and may be entered using an input-constrained device.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. patent application Ser. No. 12/018,566, filed on Jan. 23, 2008, entitled Method and System for Incrementally Selecting and Providing Relevant Search Engines in Response to a User Query, now U.S. Pat. No. 8,073,860, which is a continuation-in-part of and claims priority under 35 U.S.C. §120 to U.S. patent application Ser. No. 11/694,596 filed on Mar. 30, 2007, entitled User Interface Method and System for Incrementally Searching and Selecting Content Items and for Presenting Advertising in Response to Search Activities, which claims priority under 35 U.S.C. §119(e) to U.S. Provisional Application No. 60/787,412 filed on Mar. 30, 2006, entitled Method and System for Advertising in Systems Supporting Incremental Search, and U.S. Provisional Application No. 60/886,136 filed on Jan. 23, 2007, entitled Methods and Systems for Finding Desired Search Results and Predicting Ideal Search Engines Based on Partial Text Query Input, all of which are incorporated herein by reference in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention generally relates to providing relevant search results using incremental search with minimal text entry, and more specifically to incrementally selecting and providing relevant search engines in response to a user query.

2. Description of Related Art

On devices with overloaded keyboards, such as portable phones, it is inconvenient to type an entire search query before obtaining results.

One new development in search engine technology intended to address this issue is the method of incremental search with minimal text entry. In systems incorporating incremental search with minimal text entry, search results are returned as text is entered. Each time the user enters or deletes a character, a new search is conducted using the partial search string entered. Depending on the efficiency of the search algorithm, the results expected by the user are displayed even before a full word of text is entered. Therefore, the user need not enter all the characters in the keyword he has in mind in order to obtain the results corresponding to the keyword.

For example, in order to obtain the results for “pizza” using incremental search, the user is not required to first enter the entire word “pizza” and then request a search. As soon as the user enters the character “p,” results based on the partial search query are returned. Once the user enters the character “i,” a new search is performed and the result set is narrowed. If the user sees the results for “pizza” among the set returned after entering “pi”, he selects the result immediately without entering any more characters.

Incremental search with minimal text entry is particularly useful on input-constrained devices. However, it may also be used on systems with full-size keyboards, in order to reduce the effort required to obtain the required results. The data space on which the search is performed can be either from a single domain (for example, only entertainment content) or from multiple domains (for example, entertainment content, phone directories, stock quotes, etc.). There are many variations of the minimal text entry methodology depending on the specialized data domains in which the search is performed. For example, in data domains that require entry of names of people, the initials of the person concerned could be a valid search. Partial prefixes of the components of the names of persons or titles of movies or books could be also used.

Another way to minimize the required amount of text entry is by using a query-completion system. For example, browsers designed for mobile phones, including third-party browsers such as the Opera mini Browser as well as proprietary phone browsers, provide text composition capabilities for typing text into webpage fields. When the webpage field is a search field, these capabilities can aid query composition on overloaded keypads such as the numeric keypads on phones.

Browsers can aid in query composition using a variety of methods. They can provide a menu of previous search queries entered, so the user can select the appropriate query as desired. The browser can also invoke the phone's text editing facilities (which a user invokes while typing in messages, for instance) such as the T9 dictionary mode or the multiple-tap keystroke disambiguation mode found commonplace on numeric keypads of phones. When a phone browser uses text composition capabilities such as the T9 system, the refinement and selection states are often combined: the user gets the next refinement choice being offered by the system only when s/he tabs to pass a previous refinement being offered by the system.

Google Suggest is another system designed to construct search queries predictively, based on a partial query typed by the user. As the user types his query, the Google Suggest system allows the user to refine the query string by providing up to ten possible query refinement choices. The partial query that has been entered by the user is always a strict prefix of each of the refinement choices offered by Google Suggest. At every refinement point, the user can either select the choice (using a Mouse Left Click or Enter Key while Mouse focus is on that choice) to launch the exact choice in the Google Web Search Engine. Alternatively, the user can use the choice as an incremental refinement in the query by using the Mouse Right Click while focus is on that choice and continue to add more input to the query. At any point the user can hit Enter to pass the current contents of the text field to the Google search engine, or left-click one of the other links for “Images”, “Maps”, “Videos” to launch the same query in any one of these specific search engines of Google. However, at no point during the query refinement process does the Google Suggest system offer query-specific links; only query refinements are provided.

BRIEF SUMMARY OF THE INVENTION

This application provides methods and systems for incrementally selecting and providing relevant search engines in response to a user query.

Under one aspect of the invention, a method of incrementally selecting and providing relevant search engines includes identifying a set of search engines associated with corresponding metadata, receiving a partial search query entered by the user of a device, inferring after each user keypress a set of potential full queries intended by the user, using the potential full queries and the search engine metadata to identify a set of relevant search engines, and for each of these search engines, providing a direct link to launch a relevant query in the search engine.

Under another aspect of the invention, at least one of the inferred potential full queries is presented to the user.

Under another aspect of the invention, at least one of the fully qualified search engine links is presented to the user.

Under another aspect of the invention, the potential full queries are ranked according to their estimated relevance.

Under another aspect of the invention, the potential full queries are determined according to learned user preferences.

Under another aspect of the invention, the relevant search engines are selected using a metadata-matching technique.

Under another aspect of the invention, the partial query entered by the user is comprised of ambiguous text entered on an input-constrained keypad.

Under another aspect of the invention, the search logic corrects for erroneous input by the user.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING

For a more complete understanding of various embodiments of the present invention, reference is now made to the following descriptions taken in connection with the accompanying drawings, in which:

FIG. 1 illustrates a search system employing incremental search with minimal text entry.

FIG. 2 illustrates an advertisement system in accordance with one or more embodiments of the invention being used in a different range of device and network configurations.

FIG. 3 illustrates a user device configuration to perform incremental search and display of advertisements.

FIG. 4 illustrates the two states in which the user search session can be in the advertisement system presented in this invention.

FIG. 5 illustrates the state transition logic when starting from the Ambiguous state.

FIG. 6 illustrates the state transition logic when starting from the Unambiguous state.

FIG. 7 illustrates the operation of a system that offers relevant search engine links at each refinement point.

FIG. 8 illustrates the operation of a system that offers relevant search engine links at each selection point.

FIG. 9 illustrates the operation of a system that offers relevant search engine links at each selection point, and also offers incremental search and display of advertisements.

FIG. 10 illustrates the operation of a system that offers relevant search engine links at each refinement point, and also offers incremental search and display of advertisements.

FIG. 11 illustrates an example of the type of information displayed to the user in an embodiment that provides both advertisements and search engine links.

DETAILED DESCRIPTION Introduction

Preferred embodiments of the present invention provide a search system that incrementally provides information and suggestions based on minimal text input. While the user types a query into a graphical search box, the system provides suggested query refinements, commercial advertisements and informational links selected according to the user's partial query. The system may also provide information about what search engines are likely to be relevant to the query the user is attempting to enter, allowing the user to launch the desired query directly in a selected search engine without embarking on a results-fetching phase. If the user does not select any of the suggested links or search engines, he will have the option to launch the finished query in a “default” search engine.

Preferred embodiments of the invention also enable a user to perform searches using incomplete and/or incorrect input on an unambiguous or an ambiguous keypad. Minimal text entry is especially useful for applications running on input-constrained devices, such as mobile phones, PDAs, and remote controls. However, the disclosed techniques may also be used to provide incremental search results on laptops, desktop PCs, and other devices with full-size keyboards.

Related Methods and Techniques

Embodiments of the present invention build on techniques, systems and methods disclosed in earlier filed applications, including but not limited to U.S. patent application Ser. No. 11/136,261, entitled Method and System For Performing Searches For Television Programming Using Reduced Text Input, filed on May 24, 2005, U.S. patent application Ser. No. 11/246,432, entitled Method And System For Incremental Search With Reduced Text Entry Where The Relevance Of Results Is A Dynamically Computed Function of User Input Search String Character Count, filed on Oct. 7, 2005, U.S. patent application Ser. No. 11/235,928, entitled Method and System For Processing Ambiguous, Multiterm Search Queries, filed on Sep. 27, 2005, U.S. patent application Ser. No. 11/509,909, entitled User Interface For Visual Cooperation Between Text Input And Display Device, filed Aug. 25, 2006, U.S. patent application Ser. No. 11/682,693, entitled Methods and Systems For Selecting and Presenting Content Based On Learned Periodicity Of User Content Selection, filed on Mar. 6, 2007, and U.S. patent application Ser. No. 11/561,197, entitled System And Method For Finding Desired Results By Incremental Search Using An Ambiguous Keypad With The Input Containing Orthographic And Typographic Errors, filed on Nov. 17, 2006, the contents of which are hereby incorporated by reference.

Those applications taught specific ways to perform incremental searches using ambiguous text input, methods of ordering the search results, and techniques for learning a user's behavior and preferences. Those techniques can be used with the sets of advertisements described herein in the same or similar ways in which the techniques are applied to the collections of content items described in those applications. In such a case, the advertisements described herein represent a particular type of content item. The present techniques, however, are not limited to systems and methods disclosed in the incorporated patent applications. Thus, while reference to such systems and applications may be helpful, it is not believed necessary to understand the present embodiments or inventions.

Incremental Search Results and Advertisements

FIG. 1 illustrates one possible manifestation of incremental search. In systems incorporating incremental search with minimal text entry, text is entered in a dedicated Search Box 101. Results corresponding to the search are displayed in a Results Shelf 102 ordered according to some criteria of relevance. There are one or more dedicated spaces for Advertisements 103. The positioning of Advertisements 103 can be anywhere relative to the Results Shelf 102, such as adjacent, directly above, directly below, set-apart, etc. There can also be multiple slots for advertisements in the Advertisement space as illustrated in 103. Users can select an advertisement to trigger additional action such as seeing more information about the advertisement, view a video, call a phone number, etc.

With every incremental character entered in the Search Box, as seen in 104 compared to 101, a new search is conducted using the search string entered so far including the just-entered character and the results corresponding to the current string in the Search Box 104 are returned in the Results Shelf 105. Results in the Results Shelf 105 can also be a Fold 107, where the entry has a descriptive title (called a “label”) and stands for a collection of related items which can be accessed by selecting the Fold 107. Selecting a Fold is called “entering the Fold” or “descending the Fold”, while using any of the available navigation mechanisms to get out of the Fold and go back to the state before entering the Fold is called “exiting the Fold”. When the user has entered the Fold, he is said to be “within a Fold”.

FIG. 2 illustrates an overall system for providing advertisements along with search results in systems supporting incremental searches using a wide range of devices in accordance with one or more embodiments of the invention. An Advertisement Server Farm 201 can serve as the source of advertisements to be served. A Search Server Farm 202 can serve as the source of search data and relevance updates with a network 204 functioning as the distribution framework.

A Network 204 serves as the distribution framework. The distribution framework can be a combination of wired and wireless connections. Examples of possible networks include cable television networks, satellite television networks, IP-based television networks, wireless CDMA and GSM networks. The search devices can have a wide range of interface capabilities such as a hand-held device 205 (e.g., a phone or PDA) with limited display size and a reduced keypad, a television 206 a coupled with a remote control device 206 b having a keypad, or a Personal Computer (PC) 207 with either a full keyboard or a reduced keyboard and a computer display.

An Advertisement Bidding System 203 enables advertisers to bid for advertisement slots. Advertisers or their agents place bids not only for full words, such as “pizza”, but also for partial prefixes of words, such as, in the case of pizza, “p”, “pi”, “piz”, or “pizz”. Likewise, systems and methods described in the incorporated U.S. patent application Ser. No. 11/235,928, entitled Method and System For Processing Ambiguous, Multiterm Search Queries and U.S. patent application Ser. No. 11/509,909, entitled User Interface For Visual Cooperation Between Text Input And Display Device, can be used with the techniques described herein. Those applications taught systems where codes can be entered for words, for example, when the number on the numeric key on which a given alphabet is printed in a telephone keypad are used to stand for the alphabet itself. When used with those types of systems, bids using numbers can be used to stand for the corresponding characters. For example, “7”, “74”, and “749” can be used to stand for “p”, “pi”, “piz” respectively when the input device is a telephone keypad. For each search, the bid that is evaluated to be the one that is expected to generate the maximum economic utility to the entity supplying the search service is considered the winning bid. The corresponding advertisement is served by the Ad Server system 201 for display to the user in Advertisement space 103. This will be described in more detail below.

This invention also provides for an Analytics System 208 that analyzes search user behavior and provides advertisers with information that can help the advertisers determine the partial words that they can bid for related to the items they intend to advertise. As discussed above, there can be multiple slots for advertisements in the Advertisement space 103. In such a case, the determination of which advertisement to display in the multiple slots is performed sequentially on a slot by slot basis in an order determined by the system.

FIG. 3 illustrates multiple exemplary configurations for search devices in accordance with one or more embodiments of the invention. In one configuration, a search device such as the PC 207 can have a display 301, a processor 302, volatile memory 303, text input interface 304 (which can be on-device or through a wireless remote control 206 b), remote connectivity 305 to the Search Server 202 through the network 204, and persistent storage 306. A configuration for a device such as the hand-held device 205 might not include local persistent storage 306. In this case, the hand-held device 205 can have remote connectivity 305 to submit the search query to, and retrieve the search results from, the Search Server 202. A configuration for a device such as the television 206 a can include remote connectivity 305 and persistent storage 306. In this case, the device can use the remote connectivity 305 for search relevance data or for updates where the search database is distributed on the local persistent storage 306 and on the Search Server 202. The most suitable configuration for a memory constrained device is having the search data residing remotely on a server.

Referring to FIG. 4, depending on the search string entered, the state of the search session of the user in a search system implementing incremental search can be in one of two states: the Ambiguous state 401 or the Unambiguous state 402. The Advertisement Bidding System 203 allows the advertisers or their agents to place bids for advertisements in the Ambiguous state 401 and bids for advertisements in the Unambiguous state 402. As mentioned above, for each search, the bid that is evaluated to be the one that is expected to generate the maximum economic utility to the entity supplying the search service is considered the winning bid. The corresponding advertisement is served by the Ad Server system 201 for display to the user in Advertisement space 103.

The search session is in the Unambiguous state 402 if any one of the following conditions is satisfied: (1) the text in the Search Box 101 is a valid full word; (2) the text in the Search Box 101 is not a valid full word, that is, it is only a partial word, and there is a bid for that partial word in the Advertisement Bidding System 203; or (3) the user is within at least one Fold 107, as explained above, or has selected an item on the Results Shelf 102. The search session is in the Ambiguous state 401 if none of the conditions to be satisfied for being in the Unambiguous state 402 listed above are satisfied. In addition, when the user has not entered any text into the Search Box 101, the search session is in the Ambiguous state 401.

Referring to FIG. 5, when the search session is in the Ambiguous state 501 and the user takes an explicit action, such as selecting an entry in the Results Shelf 102 or entering a Fold 107, the state of the search session is moved to the Unambiguous state 502. For example, in the Results Shelf 105, if the user selects the Fold “Pizza . . . More” 107, then the search session is moved to Unambiguous state 502.

When the search session is in the Ambiguous state 501 and the user enters another character into the Search Box 101, a determination is made if the text currently in the Search Box 101, including the just entered character, is a valid full word. If the text in the Search Box 101 including the newly entered character is a full word, the state of the search session is moved to the Unambiguous state 502. For example, if the text currently in the Search Box 101 is “pizz” and the user enters the character “a”, the text in the Search Box 101 will become “pizza”, which is a valid word. Hence, the search session is moved to Unambiguous state 502. The rules determining what combination of characters constitute valid full words is dependent on the system implementing the search and can vary from system to system based on a variety of factors, including but not limited to the data domains on which the search is performed.

If, after a character is entered, the text in the Search Box 101 is not a valid full word but a partial word, the search session is retained in the Ambiguous state 401. However, if there is a bid in the Advertisement Bidding System 203 for that partial word, the state of the search session is moved to the Unambiguous state 502. For example, when there is no text currently in the text box and the user enters the character “p”, if there are no bids for “p” in the Advertisement Bidding System 203, the state is retained in Ambiguous state 501. However, if there is a bid for “p” in the Advertisement Bidding System 203, then the search session is moved to the Unambiguous state 502.

Referring to FIG. 6, when the search session is in the Unambiguous state 602 and the user is within at least one Fold, the search session is retained in the Unambiguous state 602 until the user exits all Folds. Upon the user exiting, the Search Box 101 is evaluated again, to see if the conditions for being in the Unambiguous state 601 are satisfied. If the conditions for being in Unambiguous state 602 continue to be satisfied, the search session is retained in the Unambiguous state 602, otherwise search session is moved to Ambiguous state 601. As an example, consider that the user is within the Fold “Pizza . . . More” 107, which he had selected after seeing the Results Shelf 105 after entering “pi” in the Search Box 104. When the user exits this fold, the text in the Search Box 104 will be “pi”. If there is no bid for “pi”, the search session will be moved to Ambiguous state 601.

If the search session is in the Unambiguous state 602, but not within any fold, and the user takes an action, such as deleting a character or enters one more character, then the text in the Search Box 101 is evaluated again, to see if the conditions for being in Unambiguous state 602 continue to be satisfied. If conditions for being in the Unambiguous state 602 are satisfied, the search session is retained in the Unambiguous state 602, otherwise it is moved to the Ambiguous state 401. As an example, if the current text in the Search Box 101 is “pizza”. This being a valid word, the search session is in the Unambiguous state 602. If the user deletes the “a” at the end, and the partial word “pizz” has no bid on it, the search session is moved to the Ambiguous state 601.

As noted above, competing bids are evaluated by the Advertisement Bidding System 203 and the bid that is expected to generate the maximum economic utility to the entity supplying the search service is considered the winning bid. A variety of criteria are used to determine which of the competing bids have the maximum expected economic utility to the entity supplying the search service. An example of such criteria could be based on the likelihood of the advertisement being acted upon by the individual user viewing the advertisement. For the Ambiguous state 401, this can involve factors including, but not limited to, the appearance of specific terms in the Results Shelf 105 and the relationship of the advertisement to those terms. For example, if the term “Pilates” appears on the Results Shelf 105 while in the Ambiguous state 401, then an advertisement related to Pilates may be deemed as likely to generate the maximum economic utility since the user is likely to call the advertiser and hence generate a fee for the entity providing the search.

Other factors that can be used to determine the winning bid are specific to the user of the search service at that point in time. This includes, but is not limited to, knowledge derived from the observed past behavior of the current user of the search. For example, while in the Ambiguous state 401, if the user is known to have lunch around the time the search is performed, then an advertisement for food may be determined to be the one that has a higher probability of being acted upon and therefore is expected to generate the maximum economic utility. Likewise, while in the Unambiguous state 402, if the user has entered “pi” in the Search Box 104, and advertisements for Pilates and Pizza are competing using identical bids for the partial keyword “pi”, and currently it is lunch time, the system can determine that there is a higher probability that the advertisement for Pizza is likely to be acted upon by the user (thereby generating higher economic value for the entity providing search when there is a price for the action) and hence may determine that the winning bid is the one for Pizza. Techniques disclosed in the applications incorporated above are useful in learning the user's behavior and preferences.

In one preferred embodiment of this invention, each advertisement bid has two components: one component for displaying the advertisement in the Advertisement space 103 (called an Impression) and a second component for actions performed by the user associated with the advertisement (called an Action). As an example, a pizza vendor could bid $1 for displaying “Pizza Hall: Call 555 1212” in the Advertisement space 103 and $0.50 for an action performed by the user on seeing the advertisement, such as clicking on the advertisement to call the number 555 1212. The action can be one of many other possibilities as well, such as for example, viewing a short video commercial or viewing the web site of the advertiser. In such an embodiment, the bid that is expected to generate the maximum economic utility is determined by taking into account the bids for the Impression, the probability that the user will perform the associated action, and the bids for the Action. The probability that the user will perform the associated action can be determined by taking into account a variety of factors, some of them generic factors (for example, related to the advertisement, actions of the some or all of the search users, etc.) and some other factors that take into account aspects related to the specific user of the search.

In one preferred embodiment of this invention the advertisement to be displayed to the user on an available advertisement slot in the Advertisement space 103 is determined based on which state the search session is in. The Advertisement Bidding System 203 allows the advertisers or their agents to place bids into two separate and distinct categories: bids for advertisement in the Ambiguous state 401 and bids for advertisement in the Unambiguous state 402. The Advertisement Bidding System 203 also allows bids for the Ambiguous state 401 to describe or specify the characteristics of the associated advertisement with the objective of enabling the system to determine the best advertisement to be displayed for a given available advertisement slot. Bids for the Unambiguous state 402 must also specify one or more texts associated with the bid. Such text can be not only full words, such as “pizza”, but also partial prefixes of words, such as, in the case of pizza, “p”, “pi”, “piz”, or “pizz”.

When the search session is in the Ambiguous state 401, all bids for the Ambiguous state 401 are evaluated. The bid that is evaluated to be the one that is expected to generate the maximum economic utility to the entity supplying the search service is considered the winning bid, and the corresponding advertisement is served by the Ad Server system 201 for display to the user in Advertisement space 103.

When the search session is in the Unambiguous state 402, all bids for the Unambiguous state 402 that have a perfect match of text corresponding to the bid with the words or partial words of text in the Search Box 101 as well as with the label(s) of the results or Fold(s) 107 are evaluated. Again, the bid that is evaluated to be the one that is expected to generate the maximum economic utility to the entity supplying the search service is considered the winning bid, and the corresponding advertisement is served by the Ad Server system 201 for display to the user in Advertisement space 103.

When the search session is in the Unambiguous state 402, but there are no bids available in the Advertisement Bidding system corresponding to any of the text entered in the Search Box 101 or the label(s) of results or Fold(s) 107 entered by the user, then the bids, if any, available for the Ambiguous state 401 are evaluated. For example, when the user is in the Unambiguous state 402 due to being in a Fold that is labeled as “Tom Cruise” and there are no bids for “Tom Cruise”, bids, if any, available for the Ambiguous state are evaluated and the bid that has the maximum expected economic utility to the entity supplying the search service is selected and displayed. In this case, if the search string was “br”, an advertisement for a DVD starring Brad Pitt may be determined to be the one that is expected to generate the maximum economic value because Tom Cruise and Brad Pitt are related to the overall concept of movies. Thus, there is a high likelihood of the user buying the DVD as the search session is in the Unambiguous state 402 due to being in a fold that is labeled as “Tom Cruise”, possibly indicating a desire to purchase a DVD, and the search string contains “br”, which is potentially a search for Brad Pitt. Techniques disclosed in U.S. Provisional Patent Application No. 60/825,616, entitled A Method Of Dynamically Generating Hierarchically Organized Result Clusters For An Incremental Search Query Matching One Or More Precomputed Hierarchical Clusters, filed Sep. 14, 2006, can be used with the techniques described herein. That application taught ways of generating search results based on combining concepts associated with incremental search results. Thus, those techniques can be used with the methods disclosed herein to determine which advertisements may be of interest the user by comparing concepts related to the search results and concepts related to the advertisements.

In one preferred embodiment of this invention, the Analytics System 208 provides information to advertisers on partial words entered by users in searches and the eventual selection of result items on the Results Shelf 102 in those searches. This can be used by advertisers to decide which partial words they can bid for in order to promote the items they intend to advertise. For example, if a large proportion of users who entered the partial word “pi” chose “Pizza”, then a pizza vendor would consider bidding for the partial word “pi”.

Input Incompleteness and Errors on Unambiguous and Ambiguous Keypads

Embodiments of the invention enable a user to perform searches using incomplete and/or incorrect input on an unambiguous keypad. On an unambiguous keypad, the user inputs text alphabets directly and can be aided by a query composition system to complete the full query even when the input is incomplete or erroneous relative to the full query. In the incomplete input case, the user's input process may have one or more of the following characteristics: The user may only input a prefix of the full query, or may omit one or more of the words constituting the full query, or may input only prefixes of one or more of the words constituting the full query. In the erroneous input case, the user's input process may have one or more of the following characteristics: The user may misspell one or more of the words constituting the full query or may input one or more extra words relative to the full query, or may swap one or more words relative to the full query. Additionally, the user's input process may also have one or more characteristics of the incomplete input case combined with one or more characteristics of the erroneous input case.

On an ambiguous keypad, there is a unique ‘ambiguous full query’ corresponding to the disambiguated full query the user wants to search—that is, the full query maps to a unique numeric string on a numeric keypad. For example, if the disambiguated full query is the string “car crash”, then the corresponding ambiguous full query on the standard numeric phone keypad is the string “227 27274”. The strings “227” and “27274” can be said to be words constituting the ambiguous full query, and the string “2774” can be said to be a misspelling of the word “27274” that occurs when the user omits the third letter in the word. Similarly the string “272” can be said to be a three-letter prefix of the word “27274”.

In the incomplete input case on ambiguous keypads, the user's input process may have one or more of the following characteristics: The user may only input a prefix of the ambiguous full query, or may omit one or more of the words constituting the ambiguous full query, or may input only prefixes of one or more of the words constituting the ambiguous full query. In the erroneous input case on ambiguous keypads, the user's input process may have one or more of the following characteristics: The user may misspell one or more of the words constituting the ambiguous full query or may input one or more extra words relative to the sequence of words constituting the ambiguous full query, or may swap one or more words relative to the correct sequence of words constituting the ambiguous full query. Additionally, the user's input process may also have one or more characteristics of the incomplete input case combined with one or more characteristics of the erroneous input case. Techniques disclosed in the applications incorporated above can be used to perform content searches based on input having errors.

Selecting and Providing Relevant Search Engines

Under another preferred embodiment of the invention, the search system offers to the user a dynamically computed list of search engines, selected from a database of search engines, that are likely to be particularly relevant to the user's query. In this context, any public website which has a search facility constitutes a search engine. For instance, when the refined query is related to entertainment, the recommended search engine will be a site with a search facility that is specifically targeted to entertainment, e.g. a link to the Internet Movie Database or Allmusic Search. On the other hand, when the refined query is such that the user may want to act upon it in by phoning in a reservation or booking tickets, the methods provide a website corresponding to the likely activity or a Local/Yellow Pages search engine.

If the suggested refinements and the provided search engine links fail to accurately predict the user's intent, he may then manually complete his query and launch it in a default, general-purpose search engine to obtain the widest set of search results. Thus, embodiments of the prevent invention are able to provide narrowly targeted search results without sacrificing the breadth of general-purpose search systems.

Determining the general category to which the search query relates (e.g. entertainment) and selecting search engines relevant to this category is accomplished according to the techniques described in the references listed above. For example, one preferred embodiment might use a computer database to associate both search engines and query refinements with a set of subject matter categories. When the user types “psyc” into the search field, a suggested query refinement might be “psychiatry,” which is associated in a computer database with the “Medicine” category. If the WebMD search engine is also associated with this category, the search system might provide a link that will launch the query “psychiatry” in the WebMD search engine.

Providing relevant search engines incrementally improves both the accuracy and efficiency of search systems. Users are more likely to obtain the best results from a search engine that specializes in the subject matter of the user's query. For example, the query refinement “Mansfield Park” might be associated with both the “Books” and the “Movies” categories, since it can refer either to a 19^(th) century novel or to a movie that was released in 1999. The system could then provide links to search for “Mansfield Park” on both Google Books Search and the Internet Movie Database, which are likely to provide more relevant results for books and movies, respectively, than a general-purpose search engine would provide. Also, because the system can project possible refinements from incomplete and ambiguous queries, these results can be displayed without requiring the user to type the full query. Minimal text entry improves efficiency in general, and particularly on input-constrained devices such as mobile phones or PDAs.

In preferred embodiments, the search engines are provided to the user as links, or other selectable objects, that will directly launch the desired query string in the selected search engine. In general, such links are generated by embedding the query string into a search engine Uniform Resource Locator (URL). For example, the following URL may be used to launch a search for the query string “Casablanca” on the imdb.com search engine:

http://www.imdb.com/find?s=all&q=casablanca&x=0&y=0

The word “Casablanca” is included in the above URL as a parameter, indicating to the imdb.com search engine that it should perform a search for the word “Casablanca” and return the results.

The format of such URLs differs across search engines. Thus, each search engine in the system is associated with a “template” URL which indicates where and how the query string must be inserted in the search engine URL to generate the desired link. For example, in one particular embodiment, the template URL associated with imdb.com might be:

http://www.imdb.com/find?s=all&q=QUERY_STRING_HERE&x=0&y=0

The search system will retrieve this template URL and generate the desired link by replacing the string “QUERY_STRING_HERE” with the desired query string.

FIG. 7 illustrates the operation of one preferred embodiment that provides the user with a selection of relevant search engine results at each refinement point, i.e., whenever suggested query refinements are available. The user begins to enter text into the search field 701 until the system reaches a refinement point 702. The text entered by the user may be ambiguous text that is entered using an input-constrained device. At this time, the system offers to the user a selection of suggested query refinements that are likely to be relevant to the partial query 703. As described by the incorporated references, this may be accomplished by matching the partial query to items in the “main database” and/or the information contained in “folds.” Also, the system may match input to metadata associated with database items.

As an example, consider the partial user query “vic cir.” Using standard dictionary prefixing, this might be expanded to the refined query “vicious circle.” The phrase “vicious circle” is the title of a stand-up comedy performance by comedian Dane Cook, and therefore might be associated with the metadata category “dane cook.” By this process of metadata matching, the string “dane cook” is returned as a possible query refinement for the initial partial query “vic cir.”

At this stage, the system also selects a set of relevant search engines based on each of the most highly-ranked query refinements and provides this list to the user. The techniques used to rank the various query refinements are described in greater detail in the above references. Each one of these search-engine links is associated with one of the provided query refinements. One preferred embodiment might use “topical” metadata associations in the database to select these search engines. For example, the category “dane cook” could be associated with topical metadata such as “comedy,” “standup”, “TV”, “moves”, “entertainment”, etc. Search engines are also associated with topical metadata categories—for example WebMD with “medicine”, IMDB with “movies”, etc. The system will compile a list of topical metadata categories associated with a refined query string, and then select search engines whose topical metadata categories overlap with this list. With the above example, the IMDB search engine would be selected (among others), since both “dane cook” and IMDB are associated with the topical metadata category “movies.”

If the user clicks on one of the provided search engine links 704, then the associated query refinement is passed to the selected search engine and a search is performed. Otherwise, if the user selects one of the provided query refinements 708, the text in the search field is changed to the selected refinement 709. Finally, the user may either launch the refined query in the default search engine 705, 707, or enter more input in the search field 701. The process of fetching results in the default search engine is detailed in the references incorporated above. The default search engine may, for example, use metadata-matching techniques to obtain the most relevant results.

FIG. 8 illustrates the operation of another preferred embodiment, in which the selection and presentation of search engines is only performed at each selection point, i.e., when the user selects a query refinement. In this method, the user begins to enter text into the search field 801 until the system is able to use the partial query string to select a list of suggested query refinements 802. At this refinement point, the system offers to the user a selection of suggested query refinements 803. The system uses the techniques described and incorporated above to determine the most appropriate refinements and rank them according to relevance. If the user selects one of the refinements 804, the system computes and provides a selection of search engine links based upon the selected refinement 805. Although techniques similar to those described above are used to determine the most appropriate search engines for the given refinement, this implementation differs in that the refinement is not incremental input, nor is it ambiguous input. Thus, the topical breadth covered by the suggested search engines is narrowly tailored to the unambiguous text of the refinement. At this point, the user has three options: first, he may choose to launch the refined query in one of the suggested search engines 807; second, he may choose to launch the refined query in the default search engine 809; finally, he may choose to further refine the query by keying in more input 801.

FIG. 9 illustrates the operation of another preferred embodiment, in which the searching system selects relevant search engines at each selection point and also provides incremental advertisements as described in the previous sections. After each character entered by the user 901, the system computes and presents a list of relevant advertisements using, e.g., the metadata matching method described above, that matches advertisements and query refinements according to their associated topical categories 902. Also, if the system reaches a refinement point 903, it presents a set of suggested query refinements to the user. By selecting one of these queries 904, the user triggers a selection point, and the system will compute and provide a selection of search engine links based upon the selected refinement in accordance with the techniques discussed in connection with FIG. 8 907. The collection of advertisements presented to the user will at this point be filtered to contain only those advertisements that are relevant to the selected query refinement. Selecting one of the search engine links will launch the refined query in the selected search engine 908, 909. Alternatively, the user may select one of the suggested advertisements 905, 906. If none of the advertisements is selected, the user may launch the refined query in the default search engine 911, or further refine the original query entry by keying in more input 901.

FIG. 10 illustrates the operation of another preferred embodiment, in which the searching system selects relevant search engines at each refinement point (in accordance with the techniques described in connection with FIG. 7) and also provides incremental advertisements as described in the previous sections. After each character entered by the user 1001, the system computes and presents a list of relevant advertisements using the method described above 1002. Also, if the system reaches a refinement point 1003, it will display a menu of suggested query refinements 1004. At this stage, the system also selects a set of relevant search engines based on each of the most highly-ranked query refinements and provides this list to the user. Thus, both the relevant advertisements and suggested query refinements are based on the incremental, and potentially ambiguous, user character entries, while the suggested relevant search engines are based on the unambiguous suggested query refinements. If the user clicks on one of the provided search engine links 1008, then the associated query refinement is passed to the selected search engine and a search is performed 1009. Alternatively, the user may select one of the suggested advertisement links 1006, 1007. Alternatively, the user may select one of the suggested query refinements 1005, which will replace the partial query in the search field with the chosen refinement 1010. Finally, the user may launch the refined query in the default search engine 1012, or further refine the query by keying in more input 1001.

FIG. 11 illustrates the types of information that might be displayed to the user by an embodiment that provides both advertisements and search engine links, such as that illustrated in FIG. 10. In this example, the user has entered an ambiguous query “626” into the search field, which, on a telephone keypad, might correspond to either of the prefixes “man” or “nan” 1101. Based on the “man” prefix, the system is able to select a list of suggested query refinements 1102, including “isle of man,” “mandolin,” “mansfield park,” “mandarin,” “manatee,” and “manilow.” Based on the “nan” prefix, the system is able to suggest the query refinements “nantucket” “nanny” and “nanny reagan.” Finally, the system may account for erroneous user entries by reducing both the input and the database entries into phonetic elements, which resist orthographic and typographic errors (as described in the application entitled System and Method for Finding Desired Results by Incremental Search Using and Ambiguous Keypad with the Input Containing Orthographic and Typographic Errors, referenced above). For example, the system might infer that the user intended to enter “pan,” which corresponds to the query refinement “pantomime.”

According to techniques described in the references listed above, these query refinements are ranked, and links to search engines that are relevant to each of the top-ranked refinements are displayed to the user 1103. For example, one preferred system implementing the disclosed techniques might monitor and record the past selections of users of the system, and use this information to bolster the relevance of suggested query refinements. For example, if the user had selected geographic links in the past, the query refinement “isle of man” would be promoted as the most relevant of the suggested refinements. Advertisements related to the current query string “man” are also displayed 1104. Selecting one of the search engine links will launch the refined query string in the selected search engine. For example, the link labeled ‘Search Wikipedia: “mandolin”’ is associated with a URL that will launch the Wikipedia search engine with the query string “mandolin.”

The above example is an illustration of the functionality of a particular embodiment. The search engines and advertisements chosen are not genuine, but are intended only to convey a general understanding. Other embodiments and implementations might suggest different query refinements, search engines, and advertisements.

The embodiments described above select and launch relevant search engines according to a query refinement, and not the actual partial query in the search box. However, other embodiments of the invention select and launch relevant search engines according to the user's partial query.

CONCLUSION

Having described preferred embodiments of the present invention, it should be apparent that modifications can be made without departing from the spirit and scope of the invention. For example, the term “advertisements” has been used herein to describe commercial offerings. However, as used herein, the term “advertisements” also represents any form of information supplied to the user.

It will be appreciated that the scope of the present invention is not limited to the above described embodiments, but rather is defined by the appended claims; and that these claims will encompass modifications of and improvements to what has been described. 

What is claimed is:
 1. A computer implemented user-interface method of incrementally providing fully qualified links to a set of relevant search engines, the method comprising: identifying a set of search engines and associating each search engine of the set with at least one descriptive category to which the subject matter of the corresponding search engine relates; receiving a partial search query entered on a keypad by a user; after at least one keypress received from the user, inferring a set of potential full queries intended by the user, based at least in part on the partial search query; selecting a subset of the identified search engines that are relevant to at least one of the set of inferred full queries based on comparing the inferred full queries with the descriptive categories associated with the search engines; and for each of the selected search engines, providing a fully qualified link designed to directly launch a search for a relevant query using the search engine; wherein the at least one keypress received from the user corresponds to a plurality of characters.
 2. The method of claim 1 wherein at least one of inferring the set of potential full queries, selecting a subset of the identified search engines, and providing the fully qualified link is performed by a server system remote from the keypad on which the user entered the partial search query.
 3. The method of claim 1 wherein at least one of inferring the set of potential full queries, selecting a subset of the identified search engines, and providing the fully qualified link is performed by a user device which includes the keypad on which the user entered the partial search query.
 4. The method of claim 1 further comprising presenting at least one of the inferred potential full queries to the user.
 5. The method of claim 1 further comprising presenting at least one of the fully qualified links to the user.
 6. The method of claim 1 further comprising estimating the degree to which each of the inferred potential full queries is relevant to the partial search query entered by the user.
 7. The method of claim 1 further comprising learning user preferences by analyzing previous user input, and inferring the potential full queries according to said learned user preferences.
 8. The method of claim 1 wherein the keypad includes overloaded keys in which each overloaded key corresponds to more than one alphanumeric character.
 9. The method of claim 1 wherein the partial search query contains ambiguous text.
 10. The method of claim 1 wherein the partial search query contains potentially erroneous data.
 11. The method of claim 1 wherein the relevant query is the partial search query entered by the user.
 12. The method of claim 1 wherein the relevant query is one of the inferred full queries.
 13. A user-interface system for incrementally providing fully qualified links to a set of relevant search engines, the system comprising: a catalog in computer readable format including a set of search engines identities, each of at least a plurality of search engines being associated with at least one descriptive category to which the subject matter of the corresponding search engine relates; computer memory comprising instructions in computer readable form that when executed cause a computer system to: receive a partial search query entered on a keypad by a user; infer, after at least one keypress received from the user, a set of potential full queries intended by the user, based at least in part on the partial search query; select a subset of the identified search engines that are relevant to at least one of the set of inferred full queries based on comparing the inferred full queries with the descriptive categories associated with the search engines; and provide, for each of the selected search engines, a fully qualified link designed to directly launch a search for a relevant query using the search engine; wherein the at least one keypress received from the user corresponds to a plurality of characters.
 14. The system of claim 13 wherein the at least one of inferring the set of potential full queries, selecting a subset of the identified search engines, and providing the fully qualified link occurs on a server system remote from the keypad on which the user entered the partial search query.
 15. The system of claim 13 wherein at least one of inferring the set of potential full queries, selecting a subset of the identified search engines, and providing the fully qualified link occurs on a user device which includes the keypad on which the user entered the partial search query.
 16. The system of claim 13, the computer memory further comprising instructions that cause the computer system to present at least one of the inferred potential full queries to the user.
 17. The system of claim 13, the computer memory further comprising instructions that cause the computer system to present at least one of the fully qualified links to the user.
 18. The system of claim 13, the computer memory further comprising instructions that cause the computer system to estimate the degree to which each of the inferred potential full queries is relevant to the partial search query entered by the user.
 19. The system of claim 13, the computer memory further comprising instructions that cause the computer system to learn user preferences by analyzing previous user input, and infer the potential full queries according to said learned user preferences.
 20. The system of claim 13 wherein the keypad includes overloaded keys in which each overloaded key corresponds to more than one alphanumeric character.
 21. The system of claim 13 wherein the partial search query contains ambiguous text.
 22. The system of claim 13 wherein the partial search query contains potentially erroneous data.
 23. The system of claim 13 wherein the relevant query string is the partial search query entered by the user.
 24. The system of claim 13 wherein the relevant query string is one of the inferred full queries. 